Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank
نویسندگان
چکیده
This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.
منابع مشابه
Adaptive Variable-Rank Approximation of General Dense Matrices
In order to handle large dense matrices arising in the context of integral equations efficiently, panel-clustering approaches (like the popular multipole expansion method) have proven to be very useful. These techniques split the matrix into blocks, approximate the kernel function on each block by a degenerate expansion, and discretize this expansion in order to find an efficient low-rank appro...
متن کاملAdaptive Variable - Rank Approximation of General Dense Matrices Steffen
In order to handle large dense matrices arising in the context of integral equations efficiently, panel-clustering approaches (like the popular multipole expansion method) have proven to be very useful. These techniques split the matrix into blocks, approximate the kernel function on each block by a degenerate expansion, and discretize this expansion in order to find an efficient low-rank appro...
متن کاملOptimal STBC over PSK signal sets from cyclotomic field extensions
An n l (l n) space time block code (STBC) C over a complex signal set S consists of a finite number of n l matrices with elements from S. For quasi-static, flat fading channels a primary performance index of C is the minimum of the rank of the difference of any two matrices, called the rank of the code. C is of full rank if its rank is n and is of minimum delay if l = n. The rate R, in bits per...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملPost-Cartesian Calibrationless Parallel Imaging Reconstruction by Structured Low-Rank Matrix Completion
Introduction: Previously, we presented a new autocalibrating parallel imaging (acPI) method that does not explicitly require autocalibration lines and is based on low-rank matrix completion [7]. This time, we extend this technique to nonCartesian trajectories. Our method jointly autocalibrates and reconstructs the images, similarly to other joint estimation (coil & data) techniques [2-5]. Howev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002